Traffic Analysis in Random Delaunay Tessellations and Other Graphs
نویسندگان
چکیده
In this work we study the degree distribution, the maximum vertex and edge flow in non-uniform random Delaunay triangulations when geodesic routing is used. We also investigate the vertex and edge flow in Erdös-Renyi random graphs, geometric random graphs, expanders and random k–regular graphs. Moreover we show that adding a random matching to the original graph can considerably reduced the maximum vertex flow.
منابع مشابه
Improved initialisation for centroidal Voronoi tessellation and optimal Delaunay triangulation
Centroidal Voronoi tessellations and optimal Delaunay triangulations can be approximated efficiently by non-linear optimisation algorithms. This paper demonstrates that the point distribution used to initialise the optimisation algorithms is important. Compared to conventional random initialisation, certain low-discrepancy point distributions help convergence towards more spatially regular resu...
متن کاملRandom tessellations and Cox processes
We consider random tessellations T in R2 and Coxian point processes whose driving measure is concentrated on the edges of T . In particular, we discuss several classes of Poisson-type tessellations which can describe e.g. the infrastructure of telecommunication networks, whereas the Cox processes on their edges can describe the locations of network components. An important quantity associated w...
متن کاملParallel algorithms for planar and spherical Delaunay construction with an application to centroidal Voronoi tessellations
A new algorithm, featuring overlapping domain decompositions, for the parallel construction of Delaunay and Voronoi tessellations is developed. Overlapping allows for the seamless stitching of the partial pieces of the global Delaunay tessellations constructed by individual processors. The algorithm is then modified, by the addition of stereographic projections, to handle the parallel construct...
متن کاملOn shape Delaunay tessellations
Shape Delaunay tessellations are a generalization of the classical Delaunay triangulation of a finite set of points in the plane, where the empty circle condition is replaced by emptiness of an arbitrary convex compact shape. We present some new and basic properties of shape Delaunay tessellations, concerning flipping, subgraph structures, and recognition.
متن کامل12 Discrete Aspects of Stochastic Geometry
Stochastic geometry studies randomly generated geometric objects. The present chapter deals with some discrete aspects of stochastic geometry. We describe work that has been done on familiar objects of discrete geometry, like finite point sets, their convex hulls, discrete point sets, arrangements of flats, tessellations of space, under various assumptions of randomness. Most of the results to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1203.4863 شماره
صفحات -
تاریخ انتشار 2012